An algorithm for Lang’s Theorem
نویسندگان
چکیده
Article history: Received 6 June 2005 Available online 25 April 2009 Communicated by William M. Kantor To John Cannon and Derek Holt on the occasions of their significant birthdays, in recognition of distinguished contributions to mathematics
منابع مشابه
Algorithm for Lang’s Theorem
We give an efficient algorithm for Lang’s Theorem in split connected reductive groups defined over finite fields of characteristic greater than 3. This algorithm can be used to construct many important structures in finite groups of Lie type. We use an algorithm for computing a Chevalley basis for a split reductive Lie algebra, which is of independent interest.
متن کاملA Note on the Descent Property Theorem for the Hybrid Conjugate Gradient Algorithm CCOMB Proposed by Andrei
In [1] (Hybrid Conjugate Gradient Algorithm for Unconstrained Optimization J. Optimization. Theory Appl. 141 (2009) 249 - 264), an efficient hybrid conjugate gradient algorithm, the CCOMB algorithm is proposed for solving unconstrained optimization problems. However, the proof of Theorem 2.1 in [1] is incorrect due to an erroneous inequality which used to indicate the descent property for the s...
متن کاملPresentation and Solving Non-Linear Quad-Level Programming Problem Utilizing a Heuristic Approach Based on Taylor Theorem
The multi-level programming problems are attractive for many researchers because of their application in several areas such as economic, traffic, finance, management, transportation, information technology, engineering and so on. It has been proven that even the general bi-level programming problem is an NP-hard problem, so the multi-level problems are practical and complicated problems therefo...
متن کاملCorrelation for Surfaces of General Type
This theorem has a number of geometric and number theoretic consequences that will be discussed in the final section of this paper. In particular, assuming Lang’s conjecture on rational points of varieties of general type, we can prove a uniform bound on the number of rational points on a surface of general type not contained in rational or elliptic curves. This theorem is a special case of the...
متن کاملLang’s height conjecture and Szpiro’s conjecture
It is known that Szpiro’s conjecture, or equivalently the ABC-conjecture, implies Lang’s conjecture giving a uniform lower bound for the canonical height of nontorsion points on elliptic curves. In this note we show that a significantly weaker version of Szpiro’s conjecture, which we call “prime-depleted,” suffices to prove Lang’s conjecture.
متن کامل